Information-Theoretically Private Matrix Multiplication From MDS-Coded Storage
نویسندگان
چکیده
We study two problems of private matrix multiplication, over a distributed computing system consisting master node, and multiple servers that collectively store family public matrices using Maximum-Distance-Separable (MDS) codes. In the first problem Private Secure Matrix Multiplication (PSMM) from colluding servers, intends to compute product its confidential A with target stored on without revealing any information about index some servers. second Fully (FPMM) is also selected another at in MDS form. this case, indices should both be kept develop novel strategies for PSMM FPMM problems, which simultaneously guarantee information-theoretic data/index privacy computation correctness. compare proposed strategy previous weaker (non-colluding servers), demonstrate substantial improvements terms communication overheads. Moreover, compared baseline uses idea Information Retrieval (PIR) directly retrieve desired significantly reduces storage overhead, but slightly incurs large
منابع مشابه
Coded Sparse Matrix Multiplication
In a large-scale and distributed matrix multiplication problem C = AB, where C ∈ Rr×t, the coded computation plays an important role to effectively deal with “stragglers” (distributed computations that may get delayed due to few slow or faulty processors). However, existing coded schemes could destroy the significant sparsity that exists in large-scale machine learning problems, and could resul...
متن کاملAchievable Rate of Private Function Retrieval from MDS Coded Databases
We study the problem of private function retrieval (PFR) in a distributed storage system. In PFR the user wishes to retrieve a linear combination of M messages stored in noncolluding (N,K) MDS coded databases while revealing no information about the coefficients of the intended linear combination to any of the individual databases. We present an achievable scheme for MDS coded PFR with a rate t...
متن کاملPrivate Information Retrieval from MDS Coded Databases with Colluding Servers under Several Variant Models
Private information retrieval (PIR) gets renewed attentions due to its information-theoretic reformulation and its application in distributed storage system (DSS). The general PIR model considers a coded database containing N servers storing M files. Each file is stored independently via the same arbitrary (N,K)-MDS code. A user wants to retrieve a specific file from the database privately agai...
متن کاملA general private information retrieval scheme for MDS coded databases with colluding servers
The problem of private information retrieval gets renewed attentions in recent years due to its information-theoretic reformulation and applications in distributed storage systems. PIR capacity is the maximal number of bits privately retrieved per one bit of downloaded bit. The capacity has been fully solved for some degenerating cases. For a general case where the database is both coded and co...
متن کاملPrivate Information Retrieval from Storage Constrained Databases - Coded Caching meets PIR
Private information retrieval (PIR) allows a user to retrieve a desired message out of K possible messages from N databases without revealing the identity of the desired message. There has been significant recent progress on understanding fundamental information theoretic limits of PIR, and in particular the download cost of PIR for several variations. Majority of existing works however, assume...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Forensics and Security
سال: 2023
ISSN: ['1556-6013', '1556-6021']
DOI: https://doi.org/10.1109/tifs.2023.3249565